Last Lecture
نویسنده
چکیده
Such a lecture series is prominent on many college campuses, made especially famous by Randy Pausch, a Carnegie Mellon professor whose lecture ironically was his last lecture having just been diagnosed with terminal pancreatic cancer. In Spring 2012, the inaugural UCSF Last Lecture received a warm and welcoming response. This year the student-initiated event will continue to build the tradition. This lecture will bring out stories intertwining various dimensions of the chosen faculty member's trajectory encompassing the professional, personal, spiritual, and cultural experiences that have brought them to where they are today.
منابع مشابه
The effect of Lecture and Focus Group Teaching Methods on Nursing Students Learning in Community Health Course
Introduction. New methods of teaching in nursing education has not been extensively investigated in Iran. Considering the importance of nursing education promotion and successful application of new methods of teaching, especially focus group method, this study was conducted to determine and compare the effect of lecture, and focus group teaching methods on nursing students' learning in communit...
متن کاملModular Forms and Diophantine Questions
This article discusses many of the topics that I touched on during my Public Lecture at the National University of Singapore and my Lecture to Schools at Victoria Junior College. During the former lecture, I spoke in broad terms about the history of Fermat’s Last Theorem and about the connection between Fermat’s Last Theorem, and the conjecture—now a theorem!—to the effect that elliptic curves ...
متن کاملCS 364 A : Algorithmic Game Theory Lecture # 17 : No - Regret Dynamics ∗
This lecture continues to study the questions introduced last time. Do strategic players reach an equilibrium of a game? How quickly? By what learning processes? Positive results on these questions justify equilibrium analysis, including bounds on the price of anarchy. Last lecture focused on best-response dynamics. These dynamics are most relevant for potential games, which cover many but not ...
متن کاملCS 264 : Beyond Worst - Case Analysis Lecture # 7 : Exact Recovery in Perturbation - Stable Minimum Cut Instances ∗
This lecture makes explicit a theme introduced surreptitiously last lecture: exact recovery. The genre of question in this sequence of lectures is: for an algorithm A of interest, for which inputs does A solve the problem exactly? For example, last lecture, we proved that the single-link++ algorithm recovers the optimal solution in every 2-stable k-median instance. We generally think of the alg...
متن کاملCS 364 A : Algorithmic Game
This lecture continues to study the questions introduced last time. Do strategic players reach an equilibrium of a game? How quickly? By what learning processes? Positive results on these questions justify equilibrium analysis, including bounds on the price of anarchy. Last lecture focused on best-response dynamics. These dynamics are most relevant for potential games, which cover many but not ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017